Description: 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression Platform: |
Size: 249856 |
Author:杨震原 |
Hits:
Description: 程序用JAVA语言编写, 综合利用图结构和堆栈结构进行数据组织和处理. 可以进行正则表达式到NFA的转化, 并能用图形直观的表示.
对正则表达式有一些约定, 就是可以用单个字符表示输入, 也可以用 ‘ ‘ 连接起来的一串字符进行输入. 有基本的表达式以及由基本表达式构成的并置, 选择和重复的操作.
例:
A|b*c
‘letter’*’digit’
等都是合法输入. 还带有括号功能, 优先级
-procedures using Java language. Comprehensive Utilization graph structure and stack structure and data processing. it is a regular expression for NFA to the transformation and can use the intuitive graphical said. Regular expressions are to some agreement and it is expressed with a single character input, we could also use '' linking the string of characters for importation. a basic expressions and by the basic form of expression and Home and choose and repeat the operation. cases : A | b* c 'letter'* 'digit' are all legally imported. also bracketed with functionality, prioritized Platform: |
Size: 12288 |
Author:onlyerlee |
Hits:
Description: 这是我自己写的将正则表达式的parser，通过将正则表达式先编译成ＮＦＡ格式，大大加快搜索速度．-This is what I wrote it myself will be the regular expression parser, by first compiling regular expressions into NFA format, greatly accelerate the search speed. Platform: |
Size: 2048 |
Author:binch |
Hits:
Description: 正则表达式转换为有穷自动机的算法，用c语言编写的。-Regular expression is converted to DFA algorithm, using c language. Platform: |
Size: 279552 |
Author:Y.A.M |
Hits:
Description: 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the final lexical analysis code to generate the whole process of demonstration. At that time, due to time constraints, lexical analysis part of automatically generated code not yet complete . Platform: |
Size: 124928 |
Author:THM |
Hits:
Description: 输入正则表达式，转化为NFA,DFA，从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring Platform: |
Size: 67584 |
Author: |
Hits:
Description: 输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成）
-Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first table structure generated by a subset of re-painting DFA graph), DFA minimization (also requires drawing method) Platform: |
Size: 14336 |
Author:liyingan |
Hits:
Description: Lex输入文件的解析
正规表达式的解析
一个正规表达式到NFA的转换算法的实现-Analysis of the Lex input file of regular expressions to resolve a formal expression to NFA conversion algorithm Platform: |
Size: 1359872 |
Author:mj |
Hits:
Description: 1.输入文件解析
2.正则表达式转化为NFA
3.多个NFA合并
4.NFA转换DFA
5代码生成
关于输入文件格式：
没有考虑对lex输入文件的出错处理，所以输入文件务必严格书写正确。
Lex中的正规表达式使用了以下运算符：
[] | * @ ( )
并且正规表达式中不能出现其他的子正规表达式。
如果想要在待识别的正则式中使用上述运算符，请使用转义符号，即\。
例如，如果想用*，可以写成\*
-1. Analysis of the input file 2. Regular expressions into NFA 3. More than the combined NFA conversion 4.NFA Code Generation DFA 5 on input file format: There is no consideration of the lex input file error handling, the input file must be written in strict correct. Lex in the regular expression operators used the following: [] |* @ () and regular expressions can not be a subset of other regular expressions. If you want to be identified in the regular-type operator to use the above, please use the escape symbol, that is, \. For example, if you want to use*, can be written in \* Platform: |
Size: 17408 |
Author:顾添锦 |
Hits:
Description: 用c++实现的此法分析器,包括正则表达式解析,正则到NFA转换,NFA到DFA转换,和最终的匹配,详见包中README文件-Using c++ parser to achieve this method, including regular expression analysis, while the NFA is converted, NFA to DFA conversion, and end the match, see the package README file Platform: |
Size: 16384 |
Author:0x7c00 |
Hits:
Description: A Program that can convert your Regular Expression to PostFix Post_Fix to NFA [Thomson s Construction] NFA to DFA [Subset Construction] DFA to minDFA [Table Filling Algorithm]
Platform: |
Size: 45056 |
Author:csp |
Hits:
Search - regular expression to nfa